Mathematical Modeling and Hybrid Heuristic for Unequal Size Facility Layout Problem

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A hybrid genetic algorithm with decomposition phases for the Unequal Area Facility Layout Problem

We address the Unequal-Area Facility-Layout Problem (UA-FLP), which aims to dimension and locate rectangular facilities in an unlimited floor space, without overlap, while minimizing the sum of distances among facilities weighted by “material-handling” flows. We introduce two algorithmic approaches to address this problem: a basic Genetic Algorithm (GA), and a GA combined with a decomposition s...

متن کامل

1. Introduction to the Unequal Area Facility Layout Problem

This paper presents an extended formulation of the unequal area facilities block layout problem which explicitly considers uncertainty in material handling costs by use of expected value and standard deviations of product forecasts. This formulation is solved using a random keys genetic algorithm (RKGA) to circumvent the need for repair operators after crossover and mutation. Because this probl...

متن کامل

A Non-greedy Local Search Heuristic for Facility Layout Problem

This paper proposes a non-greedy local search heuristic for solving facility layout problem. The proposed heuristic works on non-greedy systematic pair wise exchange of two facilities, that is 2-exchange local search based on non-greedy strategy. Pair wise exchanges are accepted if the objective function value after the exchange is lowered or smaller than the average objective function incremen...

متن کامل

Tree Structure Modeling and Genetic Algorithm-based Approach to Unequal-area Facility Layout Problem

A tree structure model has been proposed for representing the unequal-area facility layout. Each facility has a different rectangular shape specified by its area and aspect ratio. In this layout problem, based on the assumption that the shop floor has enough space for laying out the facilities, no constraint is considered for a shop floor. Objectives are minimizing total part movement between f...

متن کامل

A Hybrid Simulated Annealing algorithm for Single Row Facility Layout Problem

This article addresses a single row facility layout problem where the objective is to optimize the arrangement of some rectangular facilities with different dimensions on a line. Regarding the NP-Hard nature of the considered problem, a hybrid meta-heuristic algorithm based on simulated annealing has been proposed to obtain a near optimal solution. A number of test problems are randomly generat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Malaysian Journal of Fundamental and Applied Sciences

سال: 2014

ISSN: 2289-599X,2289-5981

DOI: 10.11113/mjfas.v5n1.290